A Constellation Resource Discovery Model Based on Scalable Multi-tape Universal Turing Machine

نویسندگان

  • Yinfeng Wang
  • Xiaoshe Dong
  • Hua Guo
  • Xiuqiang He
  • GuoRong Liu
چکیده

Constellation resource discovery model is a novel model for discovering the dynamic resources in Grid. In constellation model, we propose a new Scalable Multi-tape Universal Turing machine (SMUTM) to present the processes of simultaneous discovery tasks on the constellation nodes, and formally describe the usability of the Grid resource based on the SMUTM. In this research, we design an algorithm used in the constellation resource discovery, which guarantees overlaying all the nodes in Grid and optimizes the network cost. Preliminary simulation shows that this algorithm complexity is linear; the average response time can be reduced by 12%. Constellation model ensures the QoS of the resource discovery in the scalable and dynamic Grid environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

A Foundation of Programming a Multi-tape Quantum Turing Machine

The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multihead Quantum Turing machines with multi final states that also allow tape heads to stay still.

متن کامل

Complexity-based induction systems: Comparisons and convergence theorems

III 1964 the author proposed as an explication of a prior’ probability the probability meawe induced on output strings by a universal Turing machine with unidirectional output tape and a randomly coded unidirectional input tape. L&n bas &own tbat if F,&(x) is an mmormalized form of this measure, and P(x) is any computable probability measure on stings, x, then

متن کامل

2-State 3-Color Universal Turing Machines Don't Exist

In this brief note, we give a simple information-theoretic proof that 2-state 3-color universal Turing machines don’t exist. Let us suppose that there exists a 2-state 3-color universal Turing machine U (without a halting state). Then it must be possible to program U to emulate any Turing machine T (without a halting state) by initializing the tape of U with a string of colors that specify both...

متن کامل

Mechanical Computing: The Computational Complexity of Physical Devices

Computing Machine Models To gage the computational power of a family of mechanical computers, we will use a widely known abstract computational model known as the Turing machine, defined in this section. The Turing machine. The Turing machine model formulated by Alan Turing (1937) was the first complete mathematical model of an abstract computing machine that possessed universal computing power...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005